Improved bounds on the difference between the Szeged index and the Wiener index of graphs
نویسندگان
چکیده
Let W (G) and Sz(G) be the Wiener index and the Szeged index of a connected graph G. It is proved that if G is a connected bipartite graph of order n ≥ 4, size m ≥ n, and if ` is the length of a longest isometric cycle of G, then Sz(G) − W (G) ≥ n(m − n + ` − 2) + (`/2) − ` + 2`. It is also proved if G is a connected graph of order n ≥ 5 and girth g ≥ 5, then Sz(G) − W (G) ≥ PIv(G) − n(n − 1) + (n − g)(g − 3) + P (g), where PIv(G) is the vertex PI index of G and P is a cubic polynomial. These theorems extend related results from [Chen, Li, Liu, European J. Combin. 36 (2014) 237–246]. Several lower bounds on the difference Sz(G) −W (G) for general graphs G are also given without any condition on the girth.
منابع مشابه
The Topological Indices of some Dendrimer Graphs
In this paper the Wiener and hyper Wiener index of two kinds of dendrimer graphs are determined. Using the Wiener index formula, the Szeged, Schultz, PI and Gutman indices of these graphs are also determined.
متن کاملMORE ON EDGE HYPER WIENER INDEX OF GRAPHS
Let G=(V(G),E(G)) be a simple connected graph with vertex set V(G) and edge set E(G). The (first) edge-hyper Wiener index of the graph G is defined as: $$WW_{e}(G)=sum_{{f,g}subseteq E(G)}(d_{e}(f,g|G)+d_{e}^{2}(f,g|G))=frac{1}{2}sum_{fin E(G)}(d_{e}(f|G)+d^{2}_{e}(f|G)),$$ where de(f,g|G) denotes the distance between the edges f=xy and g=uv in E(G) and de(f|G)=∑g€(G)de(f,g|G). In thi...
متن کاملRelation Between Wiener, Szeged and Detour Indices
In theoretical chemistry, molecular structure descriptors are used to compute properties of chemical compounds. Among them Wiener, Szeged and detour indices play significant roles in anticipating chemical phenomena. In the present paper, we study these topological indices with respect to their difference number.
متن کاملOn the difference between the Szeged and the Wiener index
We prove a conjecture of Nadjafi-Arani et al. on the difference between the Szeged and the Wiener index of a graph (M. J. Nadjafi-Arani, H. Khodashenas, A. R. Ashrafi: Graphs whose Szeged and Wiener numbers differ by 4 and 5, Math. Comput. Modelling 55 (2012), 1644–1648). Namely, if G is a 2-connected non-complete graph on n vertices, then Sz (G) −W (G) ≥ 2n − 6. Furthermore, the equality is ob...
متن کاملSome Topological Indices of Nanostar Dendrimers
Wiener index is a topological index based on distance between every pair of vertices in a graph G. It was introduced in 1947 by one of the pioneer of this area e.g, Harold Wiener. In the present paper, by using a new method introduced by klavžar we compute the Wiener and Szeged indices of some nanostar dendrimers.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Eur. J. Comb.
دوره 39 شماره
صفحات -
تاریخ انتشار 2014